const github.com/klauspost/compress/flate.minMatchLength

20 uses

	github.com/klauspost/compress/flate (current package)
		deflate.go#L39: 	minMatchLength   = 4   // The smallest match that the compressor looks for
		deflate.go#L52: 	hashShift           = (hashBits + minMatchLength - 1) / minMatchLength
		deflate.go#L96: 	hashMatch [maxMatchLength + minMatchLength]uint32
		deflate.go#L133: 	if s.index >= 2*windowSize-(minMatchLength+maxMatchLength) {
		deflate.go#L237: 	loops := (n + 256 - minMatchLength) / 256
		deflate.go#L240: 		end := min(startindex+256+minMatchLength-1, n)
		deflate.go#L242: 		dstSize := len(tocheck) - minMatchLength + 1
		deflate.go#L279: 	length = minMatchLength - 1
		deflate.go#L401: 	s.length = minMatchLength - 1
		deflate.go#L415: 	if d.windowEnd-s.index < minMatchLength+maxMatchLength && !d.sync {
		deflate.go#L432: 	s.maxInsertIndex = d.windowEnd - (minMatchLength - 1)
		deflate.go#L439: 		if lookahead < minMatchLength+maxMatchLength {
		deflate.go#L472: 		s.length = minMatchLength - 1
		deflate.go#L483: 		if prevLength >= minMatchLength && s.length <= prevLength {
		deflate.go#L592: 			end += minMatchLength - 1
		deflate.go#L595: 			dstSize := len(tocheck) - minMatchLength + 1
		deflate.go#L613: 			s.length = minMatchLength - 1
		deflate.go#L624: 			if s.length >= minMatchLength {
		deflate.go#L858: 		s.length = minMatchLength - 1